• Article  

      Coding techniques for fault-tolerant parallel prefix computations in Abelian groups 

      Hadjicostis, Christoforos N. (2004)
      This paper presents coding techniques that can be used to provide fault tolerance to a parallel prefix computation that is performed on a binary tree of processing nodes. More specifically, we discuss how a parallel prefix ...
    • Conference Object  

      Efficient counting network 

      Busch, Costas; Mavronicolas, Marios (1998)
      Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. High-performance ...
    • Conference Object  

      Implementation of IEEE single precision floating point addition and multiplication on FPGAs 

      Louca, Loucas S.; Cook, Todd A.; Johnson, William H. (Affiliation: Rutgers Univ, Piscataway, United StatesCorrespondence Address: Louca, LoucasRutgers Univ, Piscataway, United States, 1996)
      Floating point operations are hard to implement on FPGAs because of the complexity of their algorithms. On the other hand, many scientific problems require floating point arithmetic with high levels of accuracy in their ...
    • Conference Object  

      Selecting Long Atomic Traces for High Coverage 

      Rosner, R.; Moffie, M.; Sazeides, Yiannakis; Ronen, R. (2003)
      This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and novel dynamic selection approaches - ...